package com.singzi.leetcode.N800;

public class T0730 {
}
class Solution0730 {
    public int countPalindromicSubsequences(String s) {
        int ans = 0;
        int n = s.length();
        int []nums = new int[n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < i; j++) {

            }
        }





        return  ans;
    }
}